NP in BQP by Partial Measurement
نویسنده
چکیده
By allowing measurement (read-out) of some, but not all, qubits, this paper shows that NP-complete problems are efficiently solvable by quantum computers in polynomial time with bounded probability (NP in BQP). This is demonstrated by describing a polynomially large network of quantum gates that solves the 3SAT problem with bounded probability in polynomial time. The “weak Church-Turing thesis” is thus shown to be false.
منابع مشابه
A Polynomial Time Bounded-error Quantum Algorithm for Boolean Satisfiability
The aim of the paper to answer a long-standing open problem on the relationship between NP and BQP. The paper shows that BQP contains NP by proposing a BQP quantum algorithm for the MAX-E3-SAT problem which is a fundamental NP-hard problem. Given an E3-CNF Boolean formula, the aim of the MAX-E3-SAT problem is to find the variable assignment that maximizes the number of satisfied clauses. The pr...
متن کاملA Bounded-error Quantum Polynomial Time Algorithm for Two Graph Bisection Problems
The aim of the paper is to propose a bounded-error quantum polynomial time (BQP) algorithm for the max-bisection and the min-bisection problems. The max-bisection and the min-bisection problems are fundamental NP-hard problems. Given a graph with even number of vertices, the aim of the max-bisection problem is to divide the vertices into two subsets of the same size to maximize the number of ed...
متن کاملNP in BQP with Nonlinearity
If one modifies the laws of Quantum Mechanics to allow nonlinear evolution of quantum states, this paper shows that NP-complete problems would be efficiently solvable in polynomial time with bounded probability (NP in BQP). With that (admittedly very unlikely) assumption, this is demonstrated by describing a polynomially large network of quantum gates that solves the 3SAT problem with bounded p...
متن کاملClassical and quantum satisfiability
Quantum computation is the paradigm of computer science wherein computations are treated as quantum physical processes. Basically, the interest on this paradigm relies on the possibility that some problems may be solved more efficiently by quantum computers than by classical ones (Cf. [2]). To analyze the relationship between the capabilities of these two very different kinds of computers, quan...
متن کاملInterpolating Between Quantum and Classical Complexity Classes
We reveal a natural algebraic problem whose complexity appears to interpolate between the well-known complexity classes BQP and NP: ⋆ Decide whether a univariate polynomial with exactly m monomial terms has a p-adic rational root. In particular, we show that while (⋆) is doable in quantum randomized polynomial time when m=2 (and no classical randomized polynomial time algorithm is known), (⋆) i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998